Partially ordered sets with nondistributive lattices of maximal antichains

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

Antichains in partially ordered sets of singular cofinality

In their paper from 1981, Milner and Sauer conjectured that for any poset 〈P,≤〉, if cf(P,≤) = λ > cf(λ) = κ, then P must contain an antichain of size κ. We prove that for λ > cf(λ) = κ, if there exists a cardinal μ < λ such that cov(λ, μ, κ, 2) = λ, then any poset of cofinality λ contains λ antichains of size κ. The hypothesis of our theorem is very weak and is a consequence of many well-known ...

متن کامل

Complete ordered sets with no infinite antichains

There are several standard constructions by which an arbitrary ordered set P is extended to one in which every subset has an. infimum and a supremuma complete ordered set. The collection I(P) of all initial segments of P ordered by inclusion is one. [A subset I of P is an initial segment if, for x, y E P, x E I whenever x s y and y E I.] I(P) is a complete distributive lattice. AnoWr is the fam...

متن کامل

Ordered sets with no infinite antichains

One approach to analyzing the structure of an ordered set has been to characterize its structure in terms of that of related objects, and vice versa. For example results in [2] characterize in terms of the ordered set P when the lattice Z(P) of lower sets (also called initial segments) of P and the ordered set Id(P) of order ideals (or simply ideals) of P have infinite antichains. The results i...

متن کامل

Maximal Chains and Antichains in Boolean Lattices

The following equivalent results in the Boolean lattice 2 are proven. (a) Every fibre of 2 contains a maximal chain. (b) Every cutset of 2 contains a maximal antichain. (c) Every red-blue colouring of the vertices of 2 produces either a red maximal chain or a blue maximal antichain. (d) Given any n antichains in 2 there is a disjoint maximal antichain. Statement (a) is then improved to: (a') Ev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1992

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1992.128363